Borel Normality and Algorithmic Randomness
نویسنده
چکیده
We prove that all random sequences (in Chaitin-Martin-Lof sense) and almost all random strings (in both Kolmogorov-Chaitin and Chaitin senses) satisfy various conditions of normality ( rst introduced by Borel). All proofs are constructive.
منابع مشابه
Algorithmic randomness and stochastic selection function
We show algorithmic randomness versions of the two classical theorems on subsequences of normal numbers. One is Kamae-Weiss theorem (Kamae 1973) on normal numbers, which characterize the selection function that preserves normal numbers. Another one is the Steinhaus (1922) theorem on normal numbers, which characterize the normality from their subsequences. In van Lambalgen (1987), an algorithmic...
متن کاملThe Kolmogorov Complexity of Liouville Numbers
We consider for a real number α the Kolmogorov complexities of its expansions with respect to different bases. In the paper it is shown that, for usual and self-delimiting Kolmogorov complexity, the complexity of the prefixes of their expansions with respect to different bases r and b are related in a way which depends only on the relative information of one base with respect to the other. More...
متن کاملLow Algorithmic Complexity Entropy-deceiving Graphs
In estimating the complexity of objects, in particular, of graphs, it is common practice to rely on graph- and information-theoretic measures. Here, using integer sequences with properties such as Borel normality, we explain how these measures are not independent of the way in which an object, such as a graph, can be described or observed. From observations that can reconstruct the same graph a...
متن کاملAn Information Theoretic Analysis of Random Number Generator based on Cellular Automaton
Realization of Randomness had always been a controversial concept with great importance both from theoretical and practical Perspectives. This realization has been revolutionized in the light of recent studies especially in the realms of Chaos Theory, Algorithmic Information Theory and Emergent behavior in complex systems. We briefly discuss different definitions of Randomness and also differen...
متن کاملA recipe for randomness.
Despite many diverse theories that address closely related themes-e. g., probability theory, algorithmic complexity, cryptoanalysis, and pseudorandom number generation-a near-void remains in constructive methods certified to yield the desired "random" output. Herein, we provide explicit techniques to produce broad sets of both highly irregular finite and normal infinite sequences, based on cons...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1993